Modelling and solving the supply marketing order allocation problem with time consistency and bundle discounts

The optimizations with respect to the supply chain management have far-reaching effects on enterprise development as well people’s livelihood. By this fact, it is important solve order allocation problem in a real scenario. We focus optimising marketing (SMOAP) various constraints from an algorithmic aspect. SMOAP considers how match orders between purchasers and suppliers maximise platform’s benefits. first formulate constrained optimisation then prove that NP-hard. formulation describes new trading mode bundle discounts, time consistency transportation cost Based mode, satisfiability modulo theories (SMT) constraint programming (CP) optimisers are performed gain efficient solutions. Moreover, we further propose tabu search (TS) two-level perturbation mechanism, score-based heuristic preprocessing techniques for promising efficiency of our approaches confirmed by experiments data instances electronic commerce platform Jiutai district Changchun city, Jilin province, China. Experimental results reveal proposed method quite effective.